Nilpotent Class Field Theory Dissertation zur Erlangung des akademischen Grades doctor rerum naturalium (Dr. rer.nat.) im Fach Mathematik

Source URL: edoc.hu-berlin.de

• Algebra
• Abstract algebra
• Ring theory
• Galois theory
• Lie groups
• Algebraic number theory
• Class field theory
• Field theory
• Schur multiplier
• Galois group
• Lie algebra
• Field

The Arithmetic-Algebra Connection: A Historical-Pedagogical Perspective K. Subramaniam and Rakhi Banerjee Abstract The problem of designing a teaching learning approach to symbolic algebra in the middle school that uses

Source URL: 158.144.44.204

Results from MathSciNet: Mathematical Reviews on the Web c Copyright American Mathematical Society12F10 Bewersdorff, J¨

Source URL: www.galois-theorie.de

• Algebra
• Abstract algebra
• Mathematics
• Equations
• Algebraic structures
• Polynomials
• Field theory
• Galois theory
• variste Galois
• Field
• Algebraic equation
• Group

A Multiplier Theorem Ka Hin Leung Department of Mathematics National University of Singapore Kent Ridge, SingaporeRepublic of Singapore

Source URL: www.ntu.edu.sg

• Algebra
• Mathematics
• Abstract algebra
• Group theory
• Combinatorics
• Order
• Divisor
• Difference set
• Multiplier
• Ring
• Algebraic number field
• Arithmetic function

Ramsey-type graph coloring and diagonal non-computability Ludovic Patey Abstract A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions pla

Source URL: ludovicpatey.com

• Computability theory
• Theory of computation
• Mathematics
• Theoretical computer science
• Mathematical analysis
• Computable function
• Sigma-algebra
• Generalised Whitehead product

Introduction to Number Theory Supplement on Gaussian Integers Spring 2016 Last Updated: April 10, 2016 This is a brief supplemental note on the Gaussian integers, written for my

Source URL: davidlowryduda.com

• Mathematics
• Algebra
• Abstract algebra
• Ring theory
• Algebraic number theory
• Commutative algebra
• Integer factorization algorithms
• Greatest common divisor
• Euclidean algorithm
• Unique factorization domain
• Factorization
• Gaussian integer

On large subsets of Fn3 with no three-term arithmetic progression Jordan S. Ellenberg University of Wisconsin-Madison 12 May 2016 Abstract

Source URL: quomodocumque.files.wordpress.com

• Algebra
• Abstract algebra
• Mathematics
• Exponentials
• Exponentiation
• IP
• Polynomials
• Invariant theory
• Ring theory

AUTOMORPHISMS OF FUSION SYSTEMS OF SPORADIC SIMPLE GROUPS BOB OLIVER Abstract. We prove here that with a very small number of exceptions, when G is a sporadic simple group and p is a prime such that the p-fusion system o

Source URL: www.math.univ-paris13.fr

• Algebra
• Abstract algebra
• Mathematics
• Finite groups
• Group theory
• Lie groups
• Morphisms
• Projective geometry
• Automorphism
• XTR
• PSL
• Representation theory

AUTOMORPHISMS OF FUSION SYSTEMS OF FINITE SIMPLE GROUPS OF LIE TYPE CARLES BROTO, JESPER M. MØLLER, AND BOB OLIVER Abstract. For a finite group G of Lie type and a prime p, we compare the automorphism groups of the fusi

Source URL: www.math.univ-paris13.fr

• Algebra
• Abstract algebra
• Group theory
• Finite groups
• Sylow theorems
• P-group
• Group extension
• Automorphism
• Abelian group
• PSL
• Center
• Group of Lie type

COMPUTING THE EHRHART QUASI-POLYNOMIAL OF A RATIONAL SIMPLEX Alexander Barvinok April 2005 We present a polynomial time algorithm to compute any fixed number of the highest

Source URL: www.math.lsa.umich.edu

• Algebra
• Mathematics
• Abstract algebra
• Polytopes
• Lie groups
• Lie algebras
• Algebraic geometry
• Ehrhart polynomial
• Valuation
• Lattice
• Distribution
• Weight